minimum spanning trees造句
例句與造句
- Minimum spanning tree algorithm based on extended double list storage structure
基于擴(kuò)展雙鏈?zhǔn)酱鎯Y(jié)構(gòu)的最小生成樹算法 - Minimum spanning tree
最小代價生成樹 - An algorithm for finding minimum spanning trees and comparison with other algorithm
求最小生成樹的另一算法及其與其它算法的比較 - Minimum spanning tree
最小生成樹 - The application and analyze about the algorithm of minimum spanning tree in multi - join
最小生成樹算法在多元連接中的應(yīng)用及算法分析 - It's difficult to find minimum spanning trees in a sentence. 用minimum spanning trees造句挺難的
- On the models of graph theory based on minimum spanning tree with applications in medicine
基于最小生成樹的圖論模型及其在醫(yī)學(xué)中的應(yīng)用 - A new algorithm based on the minimum spanning tree theory of graph was proposed which improved the computation efficiency and reliability of previous methods . 2
對基于圖的最小生成樹理論的算法進(jìn)行了改進(jìn)，新算法在效率和可靠性方面都有所提高； 2 - The algorithm starts with generating a minimum spanning tree to find basic route , and then select , an adjustable unit to modify and determine the final routes
該算法從構(gòu)造最小生成樹開始，找出基本線路；然后通過選擇可調(diào)單元調(diào)整線路得到優(yōu)化的線路。 - At first , various existing dynamic multicast routing algorithms with no constraint is compared . a dynamic multicast algorithm dpg ( dynamic prim - based greedy multicast algorithm ) which is based on minimum span tree is presented
在比較了典型的動態(tài)無約束費用優(yōu)化多播路由算法后，提出了基于最小生成樹的動態(tài)貪婪算法? ?一dpg算法。 - For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization , a heuristic search method is proposed , in which based on minimum spanning tree , degrees of vertices over the constrained degrees are reduced to the required state
摘要針對網(wǎng)絡(luò)設(shè)計和優(yōu)化中度約束最小生成樹問題，提出了一種基于貪心思想的啟發(fā)式算法求解度約束最小生成樹。 - Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
首先,采用廣度優(yōu)先搜索算法查找電氣原理圖中的連通導(dǎo)線端點集,并根據(jù)不同類型的繼電元件對應(yīng)的cad圖塊結(jié)構(gòu)的不同,得到電氣原理圖中元件接線端子之間的連接關(guān)系;其次,根據(jù)二分圖匹配算法為電氣原理圖中繼電元件選擇合適的型號和規(guī)格,并采用人工干預(yù)和自動布置相結(jié)合的方法完成屏面布置圖的自動生成;最后,提出了完全無向圖中經(jīng)過每個頂點一次且僅一次的優(yōu)化路徑算法,利用該算法和經(jīng)過預(yù)處理的prim最小生成樹算法自動生成屏內(nèi)安裝接線圖和端子接線圖。 - Different from other researches , autoore uses the proposed java semantic model as input data , and gives a tree - liked , hierarchical structured and semantic cluster set . the clustering method is based on a minimum spanning tree that represents the software system . the clustering objective function is designed according to the software modularization metric and cognition psychology theory
抽象是autoore的核心，它首次采用對象系統(tǒng)的語義關(guān)系抽取數(shù)據(jù)為輸入，利用基于mst表示的、聚集目標(biāo)結(jié)合了程序認(rèn)知心理學(xué)理論的軟件聚集方法，得到一個具有豐富語義的、組織為樹狀的、分層的聚集集合。 - Concretely we discuss the application of the shortest path problem , traveling salesman problerm and project management method on the touring itinerary improvement of travel agency . furthermore , we explore the use of minimum spanning tree problem , overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots . and also enclosed detailed spreadsheet solutions
具體的，討論了最短路問題、旅行商問題和排程問題在旅行社線路優(yōu)化中的應(yīng)用；討論了最小支撐樹問題、覆蓋問題和最大流問題在旅游景區(qū)線路優(yōu)化中的運用，并在附錄中給出了詳細(xì)的電子表格解法。 - Topics covered include : randomized computation ; data structures ( hash tables , skip lists ) ; graph algorithms ( minimum spanning trees , shortest paths , minimum cuts ) ; geometric algorithms ( convex hulls , linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms
主題包括?隨機(jī)計算、資料結(jié)構(gòu)（雜湊表、省略串列） 、圖論演算法（最小擴(kuò)張樹，最短路徑，最少切割） 、幾何演算法（凸殼、在固定或任意維度的線性規(guī)劃) 、近似計數(shù)、平行演算法、線上演算法、消去隨機(jī)技術(shù)，以及演算法的機(jī)率分析工具。 - This is improved in the nmst algorithm . the steps of constructing nmst are : firstly , construct the derived image which is generated according original image ; secondly , construct minimum spanning tree of derived image ; at last , construct spanning tree of original image by adding edges to the minimum spanning tree of derived image
針對最小生成樹算法計算量大的缺點，構(gòu)造近最小生成樹算法，近最小生成樹算法通過生成抽樣圖的最小生成樹，通過圖的擴(kuò)展得到原始圖像的近最小生成樹，將其作為預(yù)測樹對超光譜圖像進(jìn)行去相關(guān)處理。